Convexity according to the geometric mean

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Convexity According to Means

Given a function f : I → J and a pair of means M and N, on the intervals I and J respectively, we say that f is MN -convex provided that f (M(x, y)) N(f (x), f (y)) for every x , y ∈ I . In this context, we prove the validity of all basic inequalities in Convex Function Theory, such as Jensen’s Inequality and the Hermite-Hadamard Inequality. Mathematics subject classification (2000): 26A51, 26D...

متن کامل

Testing Geometric Convexity

We consider the problem of determining whether a given set S in R is approximately convex, i.e., if there is a convex set K ∈ R such that the volume of their symmetric difference is at most vol(S) for some given . When the set is presented only by a membership oracle and a random oracle, we show that the problem can be solved with high probability using poly(n)(c/ ) oracle calls and computation...

متن کامل

Convexity and geometric probabilities

In the development of the subject of Geometric Probabilities, there was always a close relationship to Convex Geometry. In these lectures, I want to demonstrate this relationship with a number of examples. These examples are of different types, since I want to cover various aspects. I start with hitting probabilities for convex bodies, which can be treated by means of integral geometry. Then I ...

متن کامل

Schur convexity of the generalized geometric Bonferroni mean and the relevant inequalities

In this paper, we discuss the Schur convexity, Schur geometric convexity and Schur harmonic convexity of the generalized geometric Bonferroni mean. Some inequalities related to the generalized geometric Bonferroni mean are established to illustrate the applications of the obtained results.

متن کامل

The geometric mean decomposition

Given a complex matrix H, we consider the decomposition H=QRP∗ where Q and P have orthonormal columns, and R is a real upper triangular matrix with diagonal elements equal to the geometric mean of the positive singular values of H. This decomposition, which we call the geometric mean decomposition, has application to signal processing and to the design of telecommunication networks. The unitary...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Mathematical Inequalities & Applications

سال: 2000

ISSN: 1331-4343

DOI: 10.7153/mia-03-19